Construction of Tests for Tables with Many-Valued Decisions
نویسندگان
چکیده
In the paper, authors present a greedy algorithm for construction of exact and partial tests (super-reducts) for decision tables with many-valued decisions. Exact tests can be over-fitted, so instead of them it is often more appropriate to work with partial tests with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial test construction, and complexity of the problem of test cardinality minimization.
منابع مشابه
Tests for Decision Tables with Many-Valued Decisions - Comparative Study
The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. The idea of algorithm is connected with so-called boundary subtables. After constr...
متن کاملGreedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions
In the paper, we study a greedy algorithm for construction of approximate decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We use an uncertainty measure which is the number of boundary subtables. We present also experimental r...
متن کاملDecision Rules for Decision Tables with Many-Valued Decisions
The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To...
متن کاملSystematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and norm...
متن کاملSystematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and normal form theorems...
متن کامل